Splittings of toric ideals

نویسندگان

چکیده

Let I⊆R=K[x1,…,xn] be a toric ideal, i.e., binomial prime ideal. We investigate when the ideal I can “split” into sum of two smaller ideals. For general I, we give sufficient condition for this splitting in terms integer matrix that defines I. When I=IG is finite simple graph G, additional splittings IG related to subgraphs G. there exists I=I1+I2 show some cases describe (multi-)graded Betti numbers I1 and I2.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Splittings of Monomial Ideals

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire’s splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bi...

متن کامل

Frobenius Splittings of Toric Varieties

We discuss a characteristic free version of Frobenius splittings for toric varieties and give a polyhedral criterion for a toric variety to be diagonally split. We apply this criterion to show that section rings of nef line bundles on diagonally split toric varieties are normally presented and Koszul, and that Schubert varieties are not diagonally split in general.

متن کامل

Toric Ideals of Phylogenetic Invariants

Statistical models of evolution are algebraic varieties in the space of joint probability distributions on the leaf colorations of a phylogenetic tree. The phylogenetic invariants of a model are the polynomials which vanish on the variety. Several widely used models for biological sequences have transition matrices that can be diagonalized by means of the Fourier transform of an abelian group. ...

متن کامل

Janet Bases of Toric Ideals

In this paper we present a version of the general polynomial involutive algorithm for computing Janet bases specialized to toric ideals. The relevant data structures are Janet trees which provide a very fast search for a Janet divisor. We broach also efficiency issues in view of application of the algorithm presented to computation of toric ideals.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2021

ISSN: ['1090-266X', '0021-8693']

DOI: https://doi.org/10.1016/j.jalgebra.2021.01.012